Dynamic partial-order reduction for model checking software

Partial-Order Reduction for GPU Model Checking

Model checking using GPUs has seen increased popularity over the last years. Because GPUs have a limited amount of memory, only small to medium-sized systems can be verified. For on-the-fly explicitstate model checking, we improve memory efficiency by applying partialorder reduction. We propose novel parallel algorithms for three practical approaches to partial-order reduction. Correctness of t...

Dynamic Path Reduction for Software Model Checking

We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general technique which we consider here in the context of the bounded model checking of sequential programs with nondeterministic conditionals. The DPR approach is based on the symbolic analysis of concrete executions. For e...

Partial Order Reduction in Directed Model Checking

Partial order reduction is a very succesful technique for avoid ing the state explosion problem that is inherent to explicit state model checking of asynchronous concurrent systems It exploits the commu tativity of concurrently executed transitions in interleaved system runs in order to reduce the size of the explored state space Directed model checking on the other hand addresses the state exp...

Model Checking with the Partial Order Reduction

Partial Order Reduction Assisted Parallel Model-Checking

Partial order reduction helps improve the performance of a (sequential) model-checker by eliminating the interleaving of independent actions. In this paper, we show how to combine partial order reduction and parallel distributed model-checking. We point out that an appropriate partial order reduction algorithm is to be chosen to avoid sequentializing an otherwise parallelizable activity. We pro...